Drawing slicing graphs with face areas
نویسندگان
چکیده
منابع مشابه
Drawing Planar Graphs with Prescribed Face Areas
This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The first one deals with straight-line drawings and the second one with orthogonal drawings. For straight-line drawings, it was known that such drawings exist for all planar graphs with maximum degree 3. We show here that such drawings exist for...
متن کاملDrawing Planar Graphs with a Prescribed Inner Face
Given a plane graph G (i.e., a planar graph with a fixed planar embedding) and a simple cycle C in G whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of G. We characterize when this is possible in terms of simple necessary conditions, which we prove to be sufficient. This also leads to a linear-time te...
متن کاملClock Face Drawing Test Performance in Children with ADHD
Introduction: The utility and discriminatory pattern of the clock face drawing test in ADHD is unclear. This study therefore compared Clock Face Drawing test performance in children with ADHD and controls. Methods: 95 school children with ADHD and 191 other children were matched for gender ratio and age. ADHD symptoms severities were assessed using DSM-IV ADHD checklist and their intellectua...
متن کاملDrawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.
متن کاملOctagonal Drawings of Plane Graphs with Prescribed Face Areas
a r t i c l e i n f o a b s t r a c t An orthogonal drawing of a plane graph is called an octagonal drawing if each inner face is drawn as a rectilinear polygon of at most eight (polygonal) vertices and the contour of the outer face is drawn as a rectangle. A slicing graph is obtained from a rectangle by repeatedly slicing it vertically and horizontally. A slicing graph is called a good slicing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.10.038